منابع مشابه
Łukasiewicz μ-calculus
The paper explores properties of Łukasiewicz μ-calculus, a version of the quantitative/probabilistic modal μ-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL. And we give a model-checking algorithm for computing the rational denotational value of a formula at an...
متن کاملŁukasiewicz μ - calculus Matteo Mio
The paper explores properties of Łukasiewicz μ-calculus, a version of the quantitative/probabilistic modal μ-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL. And we give a model-checking algorithm for computing the rational denotational value of a formula at an...
متن کاملAlternating Epistemic Mu-Calculus
Alternating-time temporal logic (ATL) is a wellknown logic for reasoning about strategic abilities of agents. An important feature that distinguishes variants of ATL for imperfect information scenarios is that the standard fixed point characterizations of temporal modalities do not hold anymore. In this paper, we show that adding explicit fixed point operators to the “next-time” fragment of ATL...
متن کاملThe Horn Mu-calculus
The Horn -calculus is a logic programming language allowing arbitrary nesting of least and greatest fixed points. The Horn -programs can naturally expresses safety and liveness properties for reactive systems. We extend the setbased analysis of classical logic programs by mapping arbitrary -programs into “uniform” -programs. Our two main results are that uniform -programs express regular sets o...
متن کاملObservational Mu-Calculus
We propose an extended modal mu-calculus to provide an ‘assembly language’ for modal logics for real time, value-passing calculi, and other extended models of computation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.126.7